-
1 polynomial complexity
Англо-русский словарь по компьютерной безопасности > polynomial complexity
-
2 complexity
Англо-русский словарь по компьютерной безопасности > complexity
-
3 polynomial time
время, требуемое компьютеру для решения задачи, когда это время - полиномиальная функция от размерности задачи (например, от объёма её входных данных)Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > polynomial time
-
4 polynomial time complexity
Англо-русский словарь по компьютерной безопасности > polynomial time complexity
-
5 sequence
2) последовательность (знаков, символов), порядок следования- sequence- finite sequence- finite-length sequence- maximum-length sequence- maximum sequenceАнгло-русский словарь по компьютерной безопасности > sequence
-
6 string
-
7 security
1) безопасность; служба безопасности2) защита; защищенностьАнгло-русский словарь по компьютерной безопасности > security
-
8 factor
1) фактор || факторный2) коэффициент; множитель3) показатель4) факторизовать; разлагать на множители•to reduce a fraction by a factor — приводить дробь к общему знаменателю; сокращать дробь на некоторый множитель
-
9 index
1) индекс, указатель || вносить в указатель; снабжать указателем2) индекс, показатель || индексировать3) коэффициент4) метка•- index of a subgroup - index of critical point - index of multiple determination - reduced ramification index
См. также в других словарях:
Complexity class — In computational complexity theory, a complexity class is a set of problems of related resource based complexity. A typical complexity class has a definition of the form: the set of problems that can be solved by an abstract machine M using… … Wikipedia
Polynomial hierarchy — In computational complexity theory, the polynomial hierarchy is a hierarchy of complexity classes that generalize the classes P, NP and co NP to oracle machines.DefinitionsThere are multiple equivalent definitions of the classes of the polynomial … Wikipedia
Polynomial time — In computational complexity theory, polynomial time refers to the computation time of a problem where the run time, m ( n ), is no greater than a polynomial function of the problem size, n .Written mathematically using big O notation, this states … Wikipedia
Complexity of constraint satisfaction — The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction… … Wikipedia
Polynomial space — In computational complexity theory, polynomial space refers to the space required in computation of a problem where the space, m ( n ), is no greater than a polynomial function of the problem size, n .Written mathematically, m ( n ) = O( n k )… … Wikipedia
Polynomial-time approximation scheme — In computer science, a polynomial time approximation scheme (abbreviated PTAS) is a type of approximation algorithm for optimization problems (most often, NP hard optimization problems).A PTAS is an algorithm which takes an instance of an… … Wikipedia
Polynomial-time reduction — In computational complexity theory a polynomial time reduction is a reduction which is computable by a deterministic Turing machine in polynomial time. If it is a many one reduction, it is called a polynomial time many one reduction, polynomial… … Wikipedia
Polynomial — In mathematics, a polynomial (from Greek poly, many and medieval Latin binomium, binomial [1] [2] [3], the word has been introduced, in Latin, by Franciscus Vieta[4]) is an expression of finite length constructed from variables (also known as… … Wikipedia
Polynomial basis — In mathematics, the polynomial basis is a basis for finite extensions of finite fields.Let α ∈ GF( p m ) be the root of a primitive polynomial of degree m over GF( p ). The polynomial basis of GF( p m ) is then:{ 0, 1, alpha, ldots, alpha^{m… … Wikipedia
polynomial time — 1. noun time complexity which is bounded by some polynomial 2. adjective (Of an algorithm) which enjoys polynomial time … Wiktionary
complexity theory — noun The study and classification of decision problems by the computational resources such as time and space needed by the programs that solve the problems. The professor of complexity theory says that the problem can be solved in polynomial time … Wiktionary